Close
Metadata

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier8JMKD3MGPEW34M/43BFNGB
Repositorysid.inpe.br/sibgrapi/2020/09.30.15.15
Last Update2020:09.30.15.15.35 (UTC) administrator
Metadata Repositorysid.inpe.br/sibgrapi/2020/09.30.15.15.35
Metadata Last Update2022:06.14.00.00.15 (UTC) administrator
DOI10.1109/SIBGRAPI51738.2020.00014
Citation KeyFernandesWalt:2020:BuLBCo
TitleA Bucket LBVH Construction and Traversal Algorithm for Volumetric Sparse Data
FormatOn-line
Year2020
Access Date2024, May 01
Number of Files1
Size777 KiB
2. Context
Author1 Fernandes, Igor Batista
2 Walter, Marcelo
Affiliation1 Universidade Federal do Rio Grande do Sul
2 Universidade Federal do Rio Grande do Sul
EditorMusse, Soraia Raupp
Cesar Junior, Roberto Marcondes
Pelechano, Nuria
Wang, Zhangyang (Atlas)
e-Mail Addressigorbf97@hotmail.com
Conference NameConference on Graphics, Patterns and Images, 33 (SIBGRAPI)
Conference LocationPorto de Galinhas (virtual)
Date7-10 Nov. 2020
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Book TitleProceedings
Tertiary TypeFull Paper
History (UTC)2020-09-30 15:15:35 :: igorbf97@hotmail.com -> administrator ::
2022-06-14 00:00:15 :: administrator -> igorbf97@hotmail.com :: 2020
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Version Typefinaldraft
KeywordsVolumetric rendering
BVH
LBVH
AbstractMany volumetric rendering algorithms use spatial 3D grids as the underlying data structure. Efficient representation, construction, and traversal of these grids are essential to achieve real-time performance, particularly for time-varying data such as in fluid simulations. In this paper, we present improvements on algorithms for building and traversing Bounding Volume Hierarchies (BVH) designed for sparse volumes. Our main insight was to simplify data layout representation by grouping voxels in buckets, preserving their spatiality using Morton codes, instead of using bricks, as current solutions use. Our solution does not use pointers nor stacks, allowing for its usage directly on computing shaders and provides, on average, 9.3x improvement in construction speed, compared with state-of-the-art approaches for Linear Bounding Volume Hierarchies (LBVH).
Arrangement 1urlib.net > SDLA > Fonds > SIBGRAPI 2020 > A Bucket LBVH...
Arrangement 2urlib.net > SDLA > Fonds > Full Index > A Bucket LBVH...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Content
agreement.html 30/09/2020 12:15 1.2 KiB 
4. Conditions of access and use
data URLhttp://urlib.net/ibi/8JMKD3MGPEW34M/43BFNGB
zipped data URLhttp://urlib.net/zip/8JMKD3MGPEW34M/43BFNGB
Languageen
Target FileBucket_LBVH.pdf
User Groupigorbf97@hotmail.com
Visibilityshown
Update Permissionnot transferred
5. Allied materials
Mirror Repositorysid.inpe.br/banon/2001/03.30.15.38.24
Next Higher Units8JMKD3MGPEW34M/43G4L9S
8JMKD3MGPEW34M/4742MCS
Citing Item Listsid.inpe.br/sibgrapi/2020/10.28.20.46 3
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
6. Notes
Empty Fieldsarchivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination edition electronicmailaddress group isbn issn label lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume
7. Description control
e-Mail (login)igorbf97@hotmail.com
update 


Close